Classification of n Variable Boolean Functions through Hamming Distance and their Application in System Biology

In this article, a noble approach is presented to classify n-variable Boolean functions in logical way such that each function belonging to a particular class can be traced with respect to a single base function. In the present study, two different methods have been proposed for this classification. The first one is done through the Hamming distance with regards to base 0 (2^n bits of zeros) Boolean function. In the second method, the classification is done to generate all Boolean functions from n variable to n+1 variable through the concatenation methodology. The presented paper also contains two unique and different methodologies for finding the cardinality of different classes. In this classification all the basis Boolean functions were captured into a